منابع مشابه
Restricted Ambiguity of Erasing Morphisms
A morphism h is called ambiguous for a string s if there is another morphism that maps s to the same image as h; otherwise, it is called unambiguous. In this paper, we examine some fundamental problems on the ambiguity of erasing morphisms. We provide a detailed analysis of so-called ambiguity partitions, and our main result uses this concept to characterise those strings that have a morphism o...
متن کاملUnambiguous Erasing Morphisms in Free Monoids
[FRS06] characterises strings with an unambiguous image of an nonerasing morphism. Only few results are known when regarding all (possibly erasing) morphisms.
متن کاملErasing errors due to alignment ambiguity when estimating positive selection.
Current estimates of diversifying positive selection rely on first having an accurate multiple sequence alignment. Simulation studies have shown that under biologically plausible conditions, relying on a single estimate of the alignment from commonly used alignment software can lead to unacceptably high false-positive rates in detecting diversifying positive selection. We present a novel statis...
متن کاملOn morphisms of crossed polymodules
In this paper, we prove that the category of crossed polymodules (i.e. crossed modules of polygroups) and their morphisms is finitely complete. We, therefore, generalize the group theoretical case of this completeness property of crossed modules.
متن کاملRandom Erasing Data Augmentation
In this paper, we introduce Random Erasing, a new data augmentation method for training the convolutional neural network (CNN). In training, Random Erasing randomly selects a rectangle region in an image and erases its pixels with random values. In this process, training images with various levels of occlusion are generated, which reduces the risk of over-fitting and makes the model robust to o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.02.041